Flexible Searching for Graph Aggregation Hierarchy

 Abstract— Signature technique for multi-key indexing is proposed for flexible searching in the area of database. In this paper, the signature technique called the Join Signature file is presented to cover graph aggregation hierarchy. The structure of Join Signature is flexible enough so that the predicate can occur at any classes in the hierarchy and the target can be anywhere in the graph aggregation hierarchy. The retrieval performance when compared with the forward and reverse traversal technique is discussed and the cost models in terms of the storage cost and the retrieval cost are then formulated using the structure explained in the research.